Parallel Constraint Distribution
نویسندگان
چکیده
منابع مشابه
Parallel Constraint Distribution in Convex Quadratic Programming
We consider convex quadratic programs with large numbers of constraints. We distribute these constraints among several parallel processors and modify the objective function for each of these subproblems with Lagrange multiplier information from the other processors. New Lagrange multiplier information is aggregated in a master processor and the whole process is repeated. Linear convergence is e...
متن کاملFast Parallel Constraint Satisfaction
Kirousis, L.M., Fast parallel constraint satisfaction (Research Note), Artificial Intelligence 64 (1993) 147-160. We describe a class of constraint satisfaction problems (CSPs) for which a global solution can be found by a fast parallel algorithm. No relaxation preprocessing is needed for the parallel algorithm to work on this class of CSPs. The result is motivated from the problem of labelling...
متن کاملParallel Distributed Constraint Satisfaction
A parallel distributed framework to solve constraint satisfaction problems based on con-nectionist ideas of distributed information processing is presented. In this approach, each variable of a given problem is associated with a simple agent continuously applying a variable manipulation rule in the spirit of local connict minimization to satisfy all constraints this variable is involved in. All...
متن کاملParallel Implementation of Constraint Solving
Many problems from artificial intelligence can be described as constraint satisfaction problems over finite domains (CSP(FD)), that is, a solution is an assignment of a value to each problem variable such that a set of constraints is satisfied. Arc-consistency algorithms remove inconsistent values from the set of values that can be assigned to a variable (its domain), thus reducing the search s...
متن کاملParallel Hardware for Constraint Satisfaction
A parallel implementation of constraint satisfaction by arc consistency is presented. The implementation is constructed of standard digital hardware elements, used in a very fine-grained, massively parallel style. As an example of how to specialize the design, a parallel implementation for solving graph isomorphism with arc consistency is also given. Complexity analyses are given for both circu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 1991
ISSN: 1052-6234,1095-7189
DOI: 10.1137/0801029